Surface Subdivision Algorithms and Structured Linear Algebra: a Computational Approach to Determine Bounds of Extraordinary Rule Weights
نویسندگان
چکیده
Abstract. In the vicinity of extraordinary vertices, the action of a primal subdivision scheme for the construction of arbitrary topology surfaces can be represented by structured matrices that form a hybrid matrix algebra related to the block-circulant algebra. Exploiting the block diagonalization of such matrices, we can easily take into consideration the constraints to be satisfied by their eigenvalues and provide an efficient computational approach for determining the ranges of variability of the weights defining the extraordinary rules. Application examples of this computational strategy are shown to find the bounds of extraordinary rule weights for improved variants of two existing subdivision schemes.
منابع مشابه
Approximate Subdivision Surface Evaluation in the Language of Linear Algebra
We present an interpretation of approximate subdivision surface evaluation in the language of linear algebra. Specifically, vertices in the refined mesh can be computed by left-multiplying the vector of control vertices by a sparse matrix we call the subdivision operator. This interpretation is rather general: it applies to any level of subdivision, it holds for many common subdivision schemes ...
متن کاملBi-3 C2 polar subdivision
Popular subdivision algorithms like Catmull-Clark and Loop are C almost everywhere, but suffer from shape artifacts and reduced smoothness exactly near the so-called “extraordinary vertices” that motivate their use. Subdivision theory explains that inherently, for standard stationary subdivision algorithms, curvature-continuity and the ability to model all quadratic shapes requires a degree of ...
متن کاملTuning Subdivision Algorithms Using Constrained Energy Optimization
In this paper a method is presented to fair the limit surface of a subdivision algorithm around an extraordinary point. The eigenvalues and eigenvectors of the subdivision matrix determine the continuity and shape of the limit surface. The dominant, sub-dominant and subsub-dominant eigenvalues should satisfy linear and quadratic equalityand inequality-constraints to guarantee continuous normal ...
متن کاملA unified approach to subdivision algorithms near extraordinary vertices
We present a unified approach to subdivision algorithms for meshes with arbitrary topology which admits a rigorous analysis of the generated surface and give a sufficient condition for the regularity of the surface, i.e. for the existence of a regular smooth parametrization near the extraordinary point. The criterion is easily applicable to all known algorithms such as those of Doo-Sabin and Ca...
متن کاملEllipsoidal bounds on state trajectories for discrete-time systems with linear fractional uncertainties
Computation of exact ellipsoidal bounds on the state trajectories of discrete-time linear systems that have time-varying or time-invariant linear fractional parameter uncertainties and ellipsoidal uncertainty in the initial state is known to be NP-hard. This paper proposes three algorithms to compute ellipsoidal bounds on such a state trajectory set and discusses the tradeoffs between computati...
متن کامل